Data-Mining Chess Databases
نویسندگان
چکیده
This is a report on the data-mining of two chess databases, the objective being to compare their sub-7-man content with perfect play as documented in Nalimov endgame tables. Van der Heijden’s ENDGAME STUDY DATABASE IV is a definitive collection of 76,132 studies in which White should have an essentially unique route to the stipulated goal. Chessbase’s BIG DATABASE 2010 holds some 4.5 million games. Insight gained into both database content and data-mining has led to some delightful surprises and created a further agenda.
منابع مشابه
Knowledge Discovery in Chess Databases: A Research Proposal
In this paper we argue that chess databases have a significant potential as a test-bed for techniques in the area of Knowledge Discovery in Databases (KDD). Conversely, we think that research in Artificial Intelligence has not yet come up with reasonable solutions for the knowledge representation and reasoning problems that are posed by knowledgebased computer chess programs, and consequently a...
متن کاملA Novel Algorithm for Association Rule Mining from Data with Incomplete and Missing Values
Missing values and incomplete data are a natural phenomenon in real datasets. If the association rules mine incomplete disregard of missing values, mistaken rules are derived. In association rule mining, treatments of missing values and incomplete data are important. This paper proposes novel technique to mine association rule from data with missing values from large voluminous databases. The p...
متن کاملAnalysis of Sequence Moves in Successful Chess Openings Using Data Mining with Association Rules
Chess is one of the indoor games, which improves the level of human confidence, concentration, planning skills and knowledge. The main objective of this paper is to help the chess players to improve their chess openings using data mining techniques. Budding Chess Players usually do practices by analyzing various existing openings. When they analyze and correlate thousands of openings it becomes...
متن کاملAn Ontology Design Pattern for Chess Games
We present an ontology pattern describing records of chess games. Besides being an interesting modeling problem by itself, the fact that chess is one of the most popular game in the world with hundreds of millions of active players, including several millions online players led to a huge amount of chess game data available from various online chess databases. Furthermore, these data are becomin...
متن کاملPerformance Evaluation of Rule Based Classification Algorithms
The growth of the internet has created a vast new arena for information generation. There is huge amount of data available in Information Industry. Databases today can range in size of the terabytes or more bytes of data. To address these issues, researchers turned to a new research area called Data Mining. Data mining is a technology that blends traditional data analysis methods with sophistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ICGA Journal
دوره 33 شماره
صفحات -
تاریخ انتشار 2010